A Uniied Cryptographic Protocol Logic

نویسندگان

  • Paul F. Syverson
  • Paul C. van Oorschot
چکیده

We present a logic for analyzing cryptographic protocols. This logic is based on a uniication of four of its predecessors in the BAN family of logics, namely those given in GNY90], AT91], vO93b], and BAN itself BAN89]. The logic herein captures the desirable features of its predecessors and more; nonetheless, as a logic it is relatively simple and simple to use. We also present a model-theoretic semantics, and we prove soundness for the logic with respect to that semantics. We illustrate the logic by applying it to the Needham-Schroeder protocol, revealing that BAN analysis of it may lead to inappropriate conclusions in some settings. We also use the logic to analyze two key agreement protocols , examining an attack on one of them.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Framework for Proving the Correctness of Cryptographic Protocol Properties by Linear Temporal Logic

In this paper, a framework for cryptographic protocol analysis using linear temporal logic is proposed. The framework can be used to specify and analyse security protocols. It aims to investigate and analyse the security protocols properties that are secure or have any flaws. The framework extends the linear temporal logic by including the knowledge of participants in each status that may chang...

متن کامل

2 An Algebraic - Temporal Speci

This paper presents a formal development of a CSMA/CD (Carrier Sense, Multiple Access with Collision Detection) protocol. Using a combination of temporal logic and algebraic speciications we describe the message layout and the behavioral aspects of the protocol in a uniied framework. We beneet from the deduction system of temporal logic to establish safety and liveness properties of the protocol.

متن کامل

Categorizing Attacks on Cryptographic Protocols Based on Intruders' Objectives and Roles

A taxonomy of cryptographic protocol attacks is helpful for cryptographic protocol analysis. There are taxonomies of cryptographic protocol awss5, 9] and a taxonomy of replay attacks in terms of message origin and destinationn25]. This paper presents an attack taxonomy based on an intruder's objectives when launching attacks and the roles s/he plays. Understanding an intruder's possible behavio...

متن کامل

On the Automation of Gny Logic

The cryptographic protocol analysis logic of Gong, Needham and Yahalom (GNY) ooers signiicant advantages over its predecessor, the Burrows, Abadi and Needham (BAN) logic. Manual analysis of protocols using the GNY logic, however, is cumbersome , as the logic has a large set of inference rules. This paper proposes a modiied GNY logic, and describes the implementation of a protocol analysis tool ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996